Permanent does not have succinct polynomial size arithmetic circuits of constant depth
نویسندگان
چکیده
منابع مشابه
Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth
We show that over fields of characteristic zero there does not exist a polynomial p(n) and a constant-free succinct arithmetic circuit family {Φn}, where Φn has size at most p(n) and depth O(1), such that Φn computes the n × n permanent. A circuit family {Φn} is succinct if there exists a nonuniform Boolean circuit family {Cn} with O(logn) many inputs and size n such that that Cn can correctly ...
متن کاملDefinability by Constant-Depth Polynomial-Size Circuits
A function of boolean arguments is symmetric if its value depends solely on the number of l 's among its arguments. In the first part of this paper we partially characterize those symmetric functions that can be computed by constant-depth polynomial-size sequences of boolean circuits, and discuss the complete characterization. (We treat both uniform and non-uniform sequences of circuits.) Our r...
متن کاملNEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth
ACCm circuits are circuits consisting of unbounded fan-in AND, OR and MODm gates and unary NOT gates, where m is a fixed integer. We show that there exists a language in non-deterministic exponential time which can not be computed by any non-uniform family of ACCm circuits of quasipolynomial size and o(log log n) depth, where m is an arbitrarily chosen constant.
متن کاملLinear-Size Constant-Depth Polylog-Treshold Circuits
We present a simple explicit construction giving unbounded fan-in circuits with $o(n)$ gates and depth $O(r)$ for the threshold function of $n$ variables when the threshold is at most $(log n)^r$, for any integer $r>0$. This improves a result of Atjai and Ben-Or, who showed the existence of circuits of size $n^{O(1)}$. This is the highest threshold for which polynomial-size, constant-depth circ...
متن کاملA Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits
We study the class #AC of functions computed by constantdepth polynomial-size arithmetic circuits of unbounded fan-in addition and multiplication gates. No model-theoretic characterization for arithmetic circuit classes is known so far. Inspired by Immerman’s characterization of the Boolean class AC, we remedy this situation and develop such a characterization of #AC. Our characterization can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2013
ISSN: 0890-5401
DOI: 10.1016/j.ic.2012.10.013